Formal Verification of a Protocol for Communications over Faulty Channels
Identifieur interne : 00C308 ( Main/Exploration ); précédent : 00C307; suivant : 00C309Formal Verification of a Protocol for Communications over Faulty Channels
Auteurs : B. Chetali ; Pierre Lescanne [France]Source :
English descriptors
- KwdEn :
Abstract
This paper describes the formalization and the verification of a communication protocol over faulty channels, using the Larch prover {\sc Lp}. The chosen specification environment is {\sc Unity}, since the proposed model can be fruitfully applied to a wide variety of problems and modified or extended for special purposes. It provides a higher level of abstraction to express solutions to parallel programming problems. We show how the {\sc Unity} specifications can be mechanized in {\sc Lp}, how we can use the theorem proving methodology to prove safety and liveness of a communication protocol, and that a theorem prover can be actually used to detect flaws in a system specification.
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy
- Centre national de la recherche scientifique, Institut national de recherche en informatique et en automatique, Laboratoire lorrain de recherche en informatique et ses applications, Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001911
- to stream Crin, to step Curation: 001911
- to stream Crin, to step Checkpoint: 002B20
- to stream Main, to step Merge: 00CB65
- to stream Main, to step Curation: 00C308
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="574">Formal Verification of a Protocol for Communications over Faulty Channels</title></titleStmt><publicationStmt><idno type="RBID">CRIN:chetali95a</idno><date when="1995" year="1995">1995</date><idno type="wicri:Area/Crin/Corpus">001911</idno><idno type="wicri:Area/Crin/Curation">001911</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001911</idno><idno type="wicri:Area/Crin/Checkpoint">002B20</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002B20</idno><idno type="wicri:Area/Main/Merge">00CB65</idno><idno type="wicri:Area/Main/Curation">00C308</idno><idno type="wicri:Area/Main/Exploration">00C308</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Formal Verification of a Protocol for Communications over Faulty Channels</title><author><name sortKey="Chetali, B" sort="Chetali, B" uniqKey="Chetali B" first="B." last="Chetali">B. Chetali</name></author><author><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">Pierre Lescanne</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Larch prover</term><term>communication protocol</term><term>computer checked proof</term><term>formal verification and protocol verification</term><term>theorem prover</term><term>unity</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2240">This paper describes the formalization and the verification of a communication protocol over faulty channels, using the Larch prover {\sc Lp}. The chosen specification environment is {\sc Unity}, since the proposed model can be fruitfully applied to a wide variety of problems and modified or extended for special purposes. It provides a higher level of abstraction to express solutions to parallel programming problems. We show how the {\sc Unity} specifications can be mechanized in {\sc Lp}, how we can use the theorem proving methodology to prove safety and liveness of a communication protocol, and that a theorem prover can be actually used to detect flaws in a system specification.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement><orgName><li>Centre national de la recherche scientifique</li><li>Institut national de recherche en informatique et en automatique</li><li>Laboratoire lorrain de recherche en informatique et ses applications</li><li>Université de Lorraine</li></orgName></list><tree><noCountry><name sortKey="Chetali, B" sort="Chetali, B" uniqKey="Chetali B" first="B." last="Chetali">B. Chetali</name></noCountry><country name="France"><region name="Grand Est"><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">Pierre Lescanne</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C308 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C308 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:chetali95a
|texte= Formal Verification of a Protocol for Communications over Faulty Channels
}}
| This area was generated with Dilib version V0.6.33. |  |